<software> A program that executes a byte code program. An example is the Java Virtual Machine. (1999-11-28)

<unit> /bi:t/ (B) A component in the machine data hierarchy larger than a bit and usually smaller than a word; now nearly always eight bits and the smallest addressable unit of storage. A byte typically holds one character. A byte may be 9 bits on 36-bit computers. Some older architectures used "byte" for quantities of 6 or 7 bits, and the PDP-10 and IBM 7030 supported "bytes" that were actually bit-fields of 1 to 36 (or 64) bits! These usages are now obsolete, and even 9-bit bytes have become rare in the general trend toward power-of-2 word sizes. The term was coined by Werner Buchholz in 1956 during the early design phase for the IBM Stretch computer. It was a mutation of the word "bite" intended to avoid confusion with "bit". In 1962 he described it as "a group of bits used to encode a character, or the number of bits transmitted in parallel to and from input-output units". The move to an 8-bit byte happened in late 1956, and this size was later adopted and promulgated as a standard by the System/360 operating system (announced April 1964). James S. Jones <jsjones@graceland.edu> adds: I am sure I read in a mid-1970's brochure by IBM that outlined the history of computers that BYTE was an acronym that stood for "Bit asYnchronous Transmission E..?" which related to width of the bus between the Stretch CPU and its CRT-memory (prior to Core). Terry Carr <bear@mich.com> says: In the early days IBM taught that a series of bits transferred together (like so many yoked oxen) formed a Binary Yoked Transfer Element (BYTE). [True origin? First 8-bit byte architecture?] See also nibble, octet. [Jargon File] (2003-09-21)

In computer science, an interpreter is a computer program that directly executes instructions written in a programming or scripting language, without requiring them previously to have been compiled into a machine language program. An interpreter generally uses one of the following strategies for program execution:

<theory> Geoff Burn defines evaluators E0, E1, E2 and E3 which when applied to an expression, reduce it to varying degrees. E0 does no evaluation, E1 it evaluates to {weak head normal form} (WHNF), E2 evaluates the structure of a list, i.e. it evaluates it either to NIL or evaluates it to a CONS and then applies E2 to the second argument of the CONS. E3 evaluates the structure of a list and evaluates each element of the list to WHNF. This concept can be extended to data structures other than lists and forms the basis of the {evaluation transformer} style of strictness analysis. (1994-12-12)

<publication> A popular computing magazine. http://byte.com. (1997-03-27)

The byte is a unit of digital information that most commonly consists of eight bits. Historically, the byte was the number of bits used to encode a single character of text in a computer and for this reason it is the smallest addressable unit of memory in many computer architectures.

intermediate language

(bytes)

<file format, software> A binary file containing an executable program, consisting of a sequence of (op code, data) pairs. Byte-code op codes are most often fixed size binary patterns, but can be variable size. The data portion consists of zero or more bits whose format typically depends on the op code. A byte-code program is interpreted by a {byte-code interpreter}. The advantage of this technique compared with outputing machine code for some particular processor is that the same byte-code can be executed on any processor on which the byte-code interpreter runs. The byte-code may be compiled to machine code ("native code") for speed of execution but this usually requires significantly greater effort for each new taraget architecture than simply porting the interpreter. For example, Java is compiled to byte-code which runs on the Java Virtual Machine. (2006-05-29)